174 : Scheduling Systems

نویسنده

  • Emil Michta
چکیده

NMCS (networked measurement–control systems) are widely used in applications ranging from difficult process control to simple discrete manufacturing. Usually, these systems impose real-time requirements on the nodes and communication networks (Kopetz, 1997; Sha and Sathaye, 1995). Stankovic (1988) defines realtime computing systems as those systems in which the correctness of the system depends not only on the logical result of computation but also on the time at which the results are produced. There are many examples of real-time computing systems, such as control systems, flight control systems, and robotics. A typical real-time computing system has a real-time program running in the system, which reads inputs from input devices, processes these inputs, and produces outputs to be sent to output devices – see also Article 78, Embedded Systems, Volume 1. The time between the arrival of an input from a device and the completion of the processing for that input is called the response time for the device (Joseph and Pandya, 1986). The relative deadline for the device can be defined as the maximum interval between the instant of the input arrival and the completion of the processing for that input. The required response time for a device must be smaller or equal to its relative deadline. In NMCS, the relative deadline is often assumed to be equal to the period. The task deadline value is set by object requirements but the value of the worst-case response time is a result of simulation methods or analytical techniques used to do the timing analysis. It is assumed that each input and output device is assigned a task of the application program and that the tasks share the same processor. The problem of determining whether the processor will meet its peak-processing load becomes one of schedulability analysis of tasks in NMCS (Burns, 1991). If the input (sensor node) and output (actuator node) devices are network components, then the input device processes events and generates messages to the output device. The problem of determining whether the communication system will meet its peak load is one of schedulability analysis of tasks. Consideration of priority levels is crucial to a real-time system. If different inputs have different response time requirements, we need to consider different priority levels to schedule the related processing tasks. The problem is to determine whether for a given assignment of priority levels, the system will meet its peak load – see also Article 165,

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimisation of assembly scheduling in VCIM systems using genetic algorithm

Assembly plays an important role in any production system as it constitutes a significant portion of the lead time and cost of a product. Virtual computer-integrated manufacturing (VCIM) system is a modern production system being conceptually developed to extend the application of traditional computer-integrated manufacturing (CIM) system to global level. Assembly scheduling in VCIM systems is ...

متن کامل

Pre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems

Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...

متن کامل

Simultaneous production planning and scheduling in a hybrid flow shop with time periods and work shifts

Simultaneous production planning and scheduling has been identified as one of the most important factors that affect the efficient implementation of planning and scheduling operations for the production systems. In this paper, simultaneous production planning and scheduling is applied in a hybrid flow shop environment, which has numerous applications in real industrial settings. In this problem...

متن کامل

Scheduling of flexible manufacturing systems using genetic algorithm: A heuristic approach

Scheduling of production in Flexible Manufacturing Systems (FMSs) has been extensively investigated over the past years and it continues to attract the interest of both academic researchers and practitioners. The generation of new and modified production schedules is becoming a necessity in today’s complex manufacturing environment. Genetic algorithms are used in this paper to obtain an initial...

متن کامل

An Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ

An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...

متن کامل

An Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ

An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004